An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations

نویسندگان

چکیده

Abstract This work addresses optimal control problems governed by a linear time-dependent partial differential equation (PDE) as well integer constraints on the control. Moreover, observations are assumed in objective function. The resulting problem poses several numerical challenges due to mixture of combinatorial aspects, induced variables, and large scale algebra issues, arising from PDE discretization. Since classical solution approaches such branch-and-bound framework typically overwhelmed large-scale problems, this extends an improved penalty algorithm proposed authors, setting. main contribution is novel combination interior point method, preconditioning, model order reduction yielding tailored local optimization solver at heart overall procedure. A thorough investigation carried out both for heat convection-diffusion demonstrating versatility approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems

Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...

متن کامل

Partial-Order Reduction for GPU Model Checking

Model checking using GPUs has seen increased popularity over the last years. Because GPUs have a limited amount of memory, only small to medium-sized systems can be verified. For on-the-fly explicitstate model checking, we improve memory efficiency by applying partialorder reduction. We propose novel parallel algorithms for three practical approaches to partial-order reduction. Correctness of t...

متن کامل

Improved Pade-Pole Clustering Approach using Genetic Algorithm for Model Order Reduction

Reducing the order of higher order systems by mixed approach is Improved Pade-Pole clustering based method to derive a reduced order approximation for a stable continuous time system is presented. In this method, the denominator polynomial of the reduced order model is derive by improved pole-clustering approach and the numerator polynomial are obtain through Padé approximation technique and by...

متن کامل

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Optimization and Applications

سال: 2022

ISSN: ['0926-6003', '1573-2894']

DOI: https://doi.org/10.1007/s10589-022-00386-8